Entropy rate of higher-dimensional cellular automata

نویسندگان

  • François Blanchard
  • Pierre Tisseur
چکیده

We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift–commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the entropy rate result from basic results about the entropy of partitions of multidimensional cellular automata. We prove several results that show that entropy rate of 2-dimensional automata preserve similar properties of the entropy of one dimensional cellular automata. In particular we establish an inequality which involves the entropy rate, the radius of the cellular automaton and the entropy of the d-dimensional shift. We also compute the entropy rate of permutative bi–dimensional cellular automata and show that the finite value of the entropy rate (like the standard entropy of for one–dimensional CA) depends on the number of permutative sites. Finally we define the topological entropy rate and prove that it is an invariant for topological shift-commuting conjugacy and establish some relations between topological and measure– theoretic entropy rates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable

Two cellular automata are strongly conjugate if there exists a shiftcommuting conjugacy between them. We prove that the following two sets of pairs (F,G) of one-dimensional one-sided cellular automata over a full shift are recursively inseparable: (i) pairs where F has strictly larger topological entropy than G, and (ii) pairs that are strongly conjugate and have zero topological entropy. Becau...

متن کامل

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

Always finite entropy and Lyapunov exponents of two-dimensional cellular automata

Given a new definition for the entropy of a cellular automata acting on a two-dimensional space, we propose an inequality between the entropy of the shift on a two-dimensional lattice and some angular analog of Lyapunov exponents.

متن کامل

On the Measure Entropy of Additive Cellular Automata f∞

We show that for an additive one-dimensional cellular automata on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule f(x ∞ f n-k, ..., xn+k) = (mod r), and a -invariant uniform Bernoulli measure μ, the measure-theoretic entropy of the additive one-dimensional cellular automata with respect to μ is equal to h ∑ −...

متن کامل

Information Along Time-like and Space-like Paths in One-dimensional Cellular Automata

Cellular Automata offer a spacially and temporally discrete example of spacially-extended dynamical systems. These are, at minimum, two-dimensional arrays of data. Information measures are best-developed for one-dimensional sequences of data, and therefor 1-D sequences must be extracted from cellular automata if such measures are to be applied. Due to the inherent limit on the spacial extent of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012